Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
نویسندگان
چکیده
منابع مشابه
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
A total coloring of a graph G is an assignment of colors to the vertices and the edges of G such that every pair of adjacent/incident elements receive distinct colors. The total chromatic number of a graph G, denoted by χ′′(G), is the minimum number of colors needed in a total coloring of G. The most well-known Total Coloring Conjecture (TCC) says that every graph with maximum degree ∆ admits a...
متن کاملTotal-Coloring of Plane Graphs with Maximum Degree Nine
The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree ∆ admits a (∆+2)-total-coloring. Similar to edge-colorings—with Vizing’s edge-coloring conjecture—this bound can be decreased by 1 for plane graphs of higher maximum degree. More precisely, it is known that if ∆ ≥ 10, then every plane graph of maximum degree ∆ is (∆ + 1)...
متن کاملOn total 9-coloring planar graphs of maximum degree seven
Given a graphG, a total k-coloring ofG is a simultaneous coloring of the vertices and edges ofGwith at most k colors. If ∆(G) is themaximum degree ofG, then no graph has a total ∆-coloring, but Vizing conjectured that every graph has a total (∆ + 2)-coloring. This Total Coloring Conjecture remains open even for planar graphs. This article proves one of the two remaining planar cases, showing th...
متن کاملEdge-choosability of planar graphs with no adjacent triangles
We show that if G is a planar graph with no two 3-faces sharing an edge and with ∆(G) 6= 5, then G is (∆(G) + 1)-edge-choosable. This improves results of Wang and Lih and of Zhang and Wu. We also show that if G is a planar graph with ∆(G) = 5 and G has no 4-cycles, then G is 6-edge-choosable. In addition, we prove that if G is a planar graph with ∆(G) = 5 and the distance between any two 3-face...
متن کاملAdjacent Vertex Distinguishing Total Coloring of Graphs with Lower Average Degree
An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of G is denoted by χ′′ a(G). Let mad(G) and ∆(G) denote the maximum average degree and the maximum degree of a graph G, respectivel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2016
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-016-0025-9